搜索资源列表
LCS
- 动态规划解决LCS-dynamic programming solution LCS
LCS-VC60
- C语言DTW算法实现,主要功能: 1)快速近邻DTW比较 2)算法稳定 3)节省内存-== Key features == 1) Fast Dynamic Time Warping nearest neighbor cost retrieval. 2) Persistence 3) External-memory: you need only a constant amount of RAM
lcs
- 动态规划实现lcs-Dynamic programming to achieve lcs
LCS
- 用LCS方法解决字符匹配问题，用到动态规划的思想。原创-LCS solution with matching characters, the idea of using dynamic programming
lcs
- 一道经典的动态规划题目 浙江大学硕士生入学复试上机题 http://acm.hdu.edu.cn/showproblem.php?pid=1231-Classic dynamic programming http://acm.hdu.edu.cn/showproblem.php?pid=1231
LCS
- 算法动态规划最长公共子序列的递归实现，并包括查找过程的体现-Dynamic programming algorithm for the longest common subsequence of the recursive implementation, and includes the process to find a manifestation of
LCS
- Longest common subsequence problem. It is dynamic approach based problem.
LCS
- 利用动态规划技术和递推的办法，求出两个字母表A和B的最大公共字串长度。-The use of dynamic programming techniques and recursive approach to find the two alphabets A and B, the largest public string length.
LCS
- 算法设计与分析课程中用动态规划算法求解最长公共子序列问题，C语言写的，很实用，有b数组和c数组的输出，很适合初学者一步一步走程序。-Algorithm design and analysis programs using dynamic programming algorithm for solving the longest common subsequence problem, C language written, very practical, with b and c array ar
LCS
- LCS问题具有最优子结构和重叠子问题的性质，因此采用动态规划算法自底向上计算该问题的解，并输出求到的LCS。-LCS problem with sub-optimal substructure and overlapping nature of the problem, so a bottom-up dynamic programming algorithm for computing the solution of the problem, and the output request to
lcs
- 算法导论中最长公共子序列的实现，采用动态规划方法-Introduction to Algorithms in the realization of the longest common subsequence, dynamic programming method
LCS
- 利用动态规划算法寻找两个list中的最长公共子序列，并分别记录了最长公共子序列的在list中的结束位置-Dynamic programming algorithm to find the two list the longest common subsequence, and recorded the longest common subsequence of the end position in the list
3.1
- 最长公共子序列问题 最长公共子序列（动态规划） 实验数据：input.txt X={A,B,C,B,D,A,B} Y={B,D,C,A,B,A} ——要求给出X、Y的最长公共子序列Z，程序运行结束时，将计算结果输出到文件output.txt中。输出文件中包含问题的答案：找不到公共子序列时给出“null” 。 -Longest common subsequence problem LCS (dynamic programming) experimental data:
LCS
- LCS 动态归划解决char 类型的最长字符串的匹配问题-LCS program to solve dynamic return type char longest matching string
LCS
- VC实现输入两个字符串，利用动态规划思想求的最长公共子序列。有可视化界面。-VC the input two strings, the use of dynamic programming requirements of the longest common subsequence. A visual interface.
LCS
- 最长公共子序列的算法实现。基于动态规划的丝线实现的算法-The longest common subsequence algorithm. Realization of the algorithm based on dynamic programming thread
LCS
- 实现最长公共子序列，使用动态规划算法，求两个序列的公共部分主要使用PHP-The public part of the longest common subsequence, using a dynamic programming algorithm, find two sequences using PHP
HDOJ-1080--LCS
- HDOJ 1080 动态规划题目。欢迎各种讨论交流。-The dynamic programming topics HDOJ 1080. Welcome discussions AC.
lcs
- 动态规划 最长子字符串匹配 可以输出多个匹配的子字符串 算法导论-Dynamic programming longest substring matching substring can output multiple matches Introduction to Algorithms
lcs
- 根据X和Y序列，利用动态规划计算出的所有LCS-The X and Y sequences is calculated using dynamic programming all LCS